Перевод: со всех языков на все языки

со всех языков на все языки

minimizing sequence

См. также в других словарях:

  • Davenport–Schinzel sequence — In combinatorics, a Davenport–Schinzel sequence is a sequence of symbols in which the number of times any two symbols may appear in alternation is limited. The maximum possible length of a Davenport–Schinzel sequence is bounded by the number of… …   Wikipedia

  • Direct method in the calculus of variations — In the calculus of variations, a topic in mathematics, the direct method is a general method for constructing a proof of the existence of a minimizer for a given functional,[1] introduced by Zaremba and David Hilbert around 1900. The method… …   Wikipedia

  • Geodesic — [ great circle arcs.] In mathematics, a geodesic IPA|/ˌdʒiəˈdɛsɪk, ˈdisɪk/ [jee uh des ik, dee sik] is a generalization of the notion of a straight line to curved spaces . In presence of a metric, geodesics are defined to be (locally) the… …   Wikipedia

  • Hilbert space — For the Hilbert space filling curve, see Hilbert curve. Hilbert spaces can be used to study the harmonics of vibrating strings. The mathematical concept of a Hilbert space, named after David Hilbert, generalizes the notion of Euclidean space. It… …   Wikipedia

  • Alt-Tab — is the common name for a keyboard shortcut on Microsoft Windows 3.1 onwards used for switching between top level windows without using the mouse; hence it was named Task Switcher ( Flip in Windows Vista). Casual users may press keypress|Alt… …   Wikipedia

  • Chemical biology — is a scientific discipline spanning the fields of chemistry and biology that involves the application of chemical techniques and tools, often compounds produced through synthetic chemistry, to the study and manipulation of biological systems.… …   Wikipedia

  • Discrete Fourier transform — Fourier transforms Continuous Fourier transform Fourier series Discrete Fourier transform Discrete time Fourier transform Related transforms In mathematics, the discrete Fourier transform (DFT) is a specific kind of discrete transform, used in… …   Wikipedia

  • Calculus of variations — is a field of mathematics that deals with extremizing functionals, as opposed to ordinary calculus which deals with functions. A functional is usually a mapping from a set of functions to the real numbers. Functionals are often formed as definite …   Wikipedia

  • Huffman coding — Huffman tree generated from the exact frequencies of the text this is an example of a huffman tree . The frequencies and codes of each character are below. Encoding the sentence with this code requires 135 bits, as opposed of 288 bits if 36… …   Wikipedia

  • Dead-end elimination — The dead end elimination algorithm (DEE) is a method for minimizing a function over a discrete set of independent variables. The basic idea is to identify dead ends , i.e., bad combinations of variables that cannot possibly yield the global… …   Wikipedia

  • Bayes estimator — In decision theory and estimation theory, a Bayes estimator is an estimator or decision rule that maximizes the posterior expected value of a utility function or minimizes the posterior expected value of a loss function (also called posterior… …   Wikipedia

Поделиться ссылкой на выделенное

Прямая ссылка:
Нажмите правой клавишей мыши и выберите «Копировать ссылку»